The multi-depot open location routing problem with a heterogeneous fixed fleet

Abstract This paper introduces the multi-depot open location routing problem (MD-OLRP) with a heterogeneous fixed fleet. The is inspired by collection of company which collects raw materials from different suppliers coordinating several carriers. Each carrier has Moreover, there cost for contracting each vehicle and variable associated distance traveled. empty haul return to vehicles depot not considered in cost. collected are delivered single delivery point. modeled as Mixed Integer Linear Program (MILP) that minimizes total cost, selecting carriers be contracted, used contracted routes. For small instances, model can solved optimality. However, approximate procedures necessary handle larger instances. In this sense, present work we propose an intelligent metaheuristic incorporates specific knowledge solve it. computational results show solution method computationally efficient provides high quality solutions. particular, new obtained case study generates savings 30.86% company. main contributions statement was found literature, its association real proposed Additional experimentation simpler obtaining best solutions compared those reported recent literature.